Constraint Model and Algorithm for the 0 - 1 Knapsack Problem

Today’s economic environment has highlighted the importance of properly optimizing every organization’s asset including space and facilities portfolio. Reducing space cost by using space more efficiently can release funds for other more important activities according to the National Audit Office (NAO) space management in higher education. Utilization rate is a function of a frequency rate and an occupancy rate. The frequency rate measures the proportion of time that space is used compared to its capacity. In this study, we have proposed a new model formulation and algorithm design for the 0-1 knapsack problem. Our proposed algorithm considers volume or space occupancy of the items as paramount, since no matter how profitable the item is to the camper if the volume or the size is bigger than that of the volume of the knapsack since every knapsack also has a volume, there would be no need to force it into the knapsack. The most interesting thing about the algorithm is that, it eliminates symmetric branching tree and the lazy sorting used by most algorithms in the literature. Computational experiments provided also show that our proposed algorithm can be among the most efficient algorithms available in the literature.